package com.dyz.leetcode._20_dynamicProgramming._72;

public class _72_minDistance01 {
    public int minDistance(String word1, String word2) {
        int m = word1.length();
        int n = word2.length();
        int[][] dp = new int[m+1][n+1];

        // 初始化
        for (int i = 0; i <= m; i++) { // 第一列
            dp[i][0] = i;
        }
        for (int i = 0; i <= n; i++) { // 第一行
            dp[0][i] = i;
        }

        for(int i=1; i<=m; i++){
            for(int j=1; j<=n; j++){
                if(word1.charAt(i-1)==word2.charAt(j-1)){
                    dp[i][j] = dp[i-1][j-1];
                }else{
                    int insertNum = dp[i][j-1]+1;
                    int deleteNum = dp[i-1][j]+1;
                    int replaceNum = dp[i-1][j-1]+1;
                    dp[i][j] = Math.min(insertNum, Math.min(deleteNum, replaceNum));
                }
            }
        }
        return dp[m][n];
    }
}
